Temporal and Social Context Based Burst Detection from Folksonomies.

Distributed Cache Indexing for Efficient Subspace Skyline Computation in P2P Networks.

ISIS A New Approach for Efficient Similarity Search in Sparse Databases.

Detecting bursty events in collaborative tagging systems.

Detecting bursty events in collaborative tagging systems.



Analysis of Factors Influencing Measurement Accuracy of Spinneret Automatic Inspection System.

Study on the Micro%2Dmeasure Technology of Continuous Automatic Measurement of Spinneret.

Content%2Denriched classifier for web video classification.

Multiple feature fusion for social media applications.

ACAR An Adaptive Cost Aware Cache Replacement Approach for Flash Memory.

Evolutionary Taxonomy Construction from Dynamic Tag Space.

A generalized framework of exploring category information for question retrieval in community question answer archives.

Exploring Correlated Subspaces for Efficient Query Processing in Sparse Databases.
Abstract—The sparse data is becoming increasingly common and available in many real-life applications. However, relative little attention has been paid to effectively model the sparse data and existing approaches such as the conventional “horizontal ” and “vertical” representations fail to provide satisfactory performance for both storage and query processing, as such approaches are too rigid and generally do not consider the dimension correlations. In this paper, we propose a new approach, named HoVer, to store and conduct query for sparse datasets in an unmodified RDBMS, where HoVer stands for Horizontal representation over Ver tically partitioned subspaces. According to the dimension correlations of sparse datasets, a novel mechanism has been developed to vertically partition a high-dimensional sparse dataset into multiple lower dimensional subspaces, and all the dimensions are highly correlated intrasubspace and highly unrelated inter-subspace respectively. Therefore, original data objects can be represented by the horizontal format in respective subspaces. With the novel HoVer representation, users can write SQL queries over the original horizontal view, which can be easily rewritten into queries over the subspace tables. Experiments over synthetic and real-life datasets show that our approach is effective in finding correlated subspaces and yields superior performance for the storage and query of sparse data.
Constructing evolutionary taxonomy of collaborative tagging systems.

The use of categorization information in language models for question retrieval.

Efficient information retrieval in mobile peer%2Dto%2Dpeer networks.

A Revisit of Query Expansion with Different Semantic Levels.

Video Annotation System Based on Categorizing and Keyword Labelling.

Hybrid Retrieval Mechanisms in Vehicle%2DBased P2P Networks.

Routing Questions to the Right Users in Online Communities.

Routing Questions to the Right Users in Online Communities.

A Novel Content Distribution Mechanism in DHT Networks.

A novel framework for efficient automated singer identification in large music databases.

Bounded coordinate system indexing for real%2Dtime video clip search.

Linking identical neighborly partitions for efficient high%2Ddimensional similarity search in unstructured peer%2Dto%2Dpeer systems.

Hybrid information retrieval policies based on cooperative cache in mobile P2P networks.

Implementation Issues of A Cloud Computing Platform.

Efficient Skyline Computation in Structured Peer%2Dto%2DPeer Systems.

Accelerating sequence searching dimensionality reduction method.

Squeezing Long Sequence Data for Efficient Similarity Search.

Effective Skyline Cardinality Estimation on Data Streams.

Compacting music signatures for efficient music retrieval.

iSky Efficient and Progressive Skyline Computing in a Structured P2P Network.

Parallel Distributed Processing of Constrained Skyline Queries by Filtering.

Towards Efficient and Flexible KNN Query Processing in Real%2DLife Road Networks.

Achieving Effective Multi%2Dterm Queries for Fast DHT Information Retrieval.

Semantic similarity based on compact concept ontology.

PGG An Online Pattern Based Approach for Stream Variation Management.

QueST querying music databases by acoustic and textual features.

LINP Supporting Similarity Search in Unstructured Peer%2Dto%2DPeer Networks.

Optimizing Moving Queries over Moving Object Data Streams.

Evaluating MAX and MIN over Sliding Windows with Various Size Using the Exemplary Sketch.

CLAIM An Efficient Method for Relaxed Frequent Closed Itemsets Mining over Stream Data.

An Optimized Process Neural Network Model.

Effective variation management for pseudo periodical streams.


Efficient index%2Dbased KNN join processing for high%2Ddimensional data.


A Web%2Dbased Framework For On%2Dline Collaborative Learning.

Summarizing Frequent Patterns Using Profiles.

Towards efficient automated singer identification in large music databases.

HSI A Novel Framework for Efficient Automated Singer Identification in Large Music Database.

A new image segmentation algorithm based on kernel spatial fuzzy c%2Dmeans %28FCM%29.

Towards efficient automated singer identification in large music databases.

Classifying E%2DMails Via Support Vector Machine.

IMPACT A twin%2Dindex framework for efficient moving object query processing.

ICICLE A semantic%2Dbased retrieval system for WWW images.
Images are increasingly being embedded in HTML documents on the WWW. Such documents over the WWW essentially provide a rich source of image collection from which users can query. Interestingly, the semantics of these images are typically described by their surrounding text. Unfortunately, most WWW image search engines fail to exploit these image semantics and give rise to poor recall and precision performance. In this paper, we present ICICLE (Image ChainNet and Incremental CLustering Engine), a prototype system that we have developed to effectively and efficiently retrieve WWW image. ICICLE has two distinguishing features. First, it employs a novel image representation model called Weight ChainNet to capture the semantics of the image content. Weight ChainNet is based on lexical chain that represents the semantics of an image from its nearby text. A new formula, called list space model, for computing semantic similarities is also introduced. With Weight ChainNet, ICICLE is able to effectively retrieve images based on their image semantics. To further improve the retrieval effectiveness, we also propose two relevance feedback mechanisms. Second, ICICLE employs an incremental clustering mechanism, ICC (Incremental Clustering on ChainNet) that narrows the search space of the retrieval process to the relevant partitions. In ICC, images with similar semantics are clustered into the same partition. Moreover, ICC facilitates incremental updates and can adaptively adjust the number of clusters and cluster sizes. We conducted an extensive performance study to evaluate ICICLE. Our results show that ICICLE is not only effective but also efficient. The Weight ChainNet used in ICICLE is able to provide better recall and precision compared to existing techniques. The relevant feedba...
Indexing and Integrating Multiple Features for WWW Images.

Exploring Bit%2DDifference for Approximate KNN Search in High%2Ddimensional Databases.
In this paper, we develop a novel index structure to support efficient approximate k-nearest neighbor (KNN) query in high-dimensional databases. In high-dimensional spaces, the computational cost of the distance (e.g., Euclidean distance) between two points contributes a dominant portion of the overall query response time for memory processing. To reduce the distance computation, we first propose a structure (BID) using BIt-Difference to answer approximate KNN query. The BID employs one bit to represent each feature vector of point and the number of bit-difference is used to prune the further points. To facilitate real dataset which is typically skewed, we enhance the BID mechanism with clustering, cluster adapted bitcoder and dimensional weight, named the BID+. Extensive experiments are conducted to show that our proposed method yields significant performance advantages over the existing index structures on both real life and synthetic high-dimensional datasets.
Indexing Text and Visual Features for WWW Images.

Towards Optimal Utilization of Main Memory for Moving Object Indexing.
Abstract. In moving object databases, existing disk-based indexes are unable to keep up with the high update rate while providing speedy retrieval at the same time. However, efficient management of moving-object database can be achieved through aggressive use of main memory. In this paper, we propose an Integrated Memory Partitioning and Activity Conscious Twin-index (IMPACT) framework where the moving object database is indexed by a pair of indexes based on the properties of the objects ’ movement- a main-memory structure manages active objects while a disk-based index handles inactive objects. As objects become active (or inactive), they dynamically migrate from one structure to the other. Moreover, the main memory is also organized into two partitions- one for the main memory index, and the other as buffers for the frequently accessed nodes of the disk-based index. Our experimental study shows that the IMPACT framework provides superior performance. 1
On Effective E%2Dmail Classification via Neural Networks.

Diagonal Ordering A New Approach to High%2DDimensional KNN Processing.

Adaptive Quantization of the High%2DDimensional Data for Efficient KNN Processing.

Main Memory Indexing The Case for BD%2DTree.

Contorting High Dimensional Data for Efficient Main Memory Processing.

Supporting Frequent Updates in R%2DTrees A Bottom%2DUp Approach.
Advances in hardware-related technologies  promise to enable new data management applications  that monitor continuous processes. In these  applications, enormous amounts of state samples  are obtained via sensors and are streamed to a  database. Further, updates are very frequent and  may exhibit locality. While the R-tree is the  index of choice for multi-dimensional data with  low dimensionality, and is thus relevant to these  applications, R-tree updates are also relatively inefficient.
Range Top%2FBottom k Queries in OLAP Sparse Data Cubes.

